Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
نویسندگان
چکیده
منابع مشابه
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
It is known that large fragments of the class of dense Minimum Constraint Satisfaction (MIN-CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to their Maximum Constraint Satisfaction analogs. In this paper we prove, somewhat surprisingly, that the minimum satisfaction of dense instances of kSAT-formulas, and linear equations mod 2, Ek-LIN2, do have PTASs for any k...
متن کاملPolynomial time approximation of dense weighted instances of MAX-CUT
We give the rst polynomial time approximability characterization of dense weighted instances of MAX-CUT, and some other dense weighted NP-hard problems in terms of their empirical weight distributions. This gives also the rst almost sharp characterization of inapproximability of unweighted 0,1 MAX-BISECTION instances in terms of their density parameter only.
متن کاملRuling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satis ed constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and so is NP-hard in general. It is natural to study how ...
متن کاملPolynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subset of points in P , to compute a subset of disks with minimum cardinality covering P . This problem is known to be NP-hard and an algorithm which approximates the optimal disk cover within a factor of (1 + ) in O(mnO( ...
متن کاملPolynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2003
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.10072